Enumeration of disjoint Hamilton cycles in a divisor Cayley graph

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Disjoint Hamilton cycles in the star graph

In 1987, Akers, Harel and Krishnamurthy proposed the star graph Σ(n) as a new topology for interconnection networks. Hamiltonian properties of these graphs have been investigated by several authors. In this paper, we prove that Σ(n) contains bn/8c pairwise edge-disjoint Hamilton cycles when n is prime, and Ω(n/ log log n) such cycles for arbitrary n.

متن کامل

Edge Disjoint Hamilton Cycles

In the late 70s, it was shown by Komlós and Szemerédi ([7]) that for p = lnn+ln lnn+c n , the limit probability for G(n, p) to contain a Hamilton cycle equals the limit probability for G(n, p) to have minimum degree at least 2. A few years later, Ajtai, Komlós and Szemerédi ([1]) have shown a hitting time version of this in the G(n,m) model. Say a graph G has property H if it contains bδ(G)/2c ...

متن کامل

Disjoint Hamilton cycles in the random geometric graph

We prove a conjecture of Penrose about the standard random geometric graph process, in which n vertices are placed at random on the unit square and edges are sequentially added in increasing order of lengths taken in the `p norm. We show that the first edge that makes the random geometric graph Hamiltonian is a.a.s. exactly the same one that gives 2-connectivity. We also extend this result to a...

متن کامل

Hamilton Cycles in Trivalent Cayley Graphs

It is shown that the Trivalent Cayley graphs, TC,,, are near recursive. In particular, TC, is a union of four copies of i”Cn_2 with additional well placed nodes. This allows one to recursively build the Hamilton cycle in TC,.

متن کامل

Edge-disjoint Hamilton cycles in random graphs

We show that provided log n/n ≤ p ≤ 1 − n−1/4 log n we can with high probability find a collection of bδ(G)/2c edge-disjoint Hamilton cycles in G ∼ Gn,p, plus an additional edge-disjoint matching of size bn/2c if δ(G) is odd. This is clearly optimal and confirms, for the above range of p, a conjecture of Frieze and Krivelevich.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Malaya Journal of Matematik

سال: 2018

ISSN: 2319-3786,2321-5666

DOI: 10.26637/mjm0603/0006